A Language for the Logical Specification of Processes and Relations

Due to its ability to handle resources in a nely controlled way, linear logic is being adopted as a foundation of several logic programming and speciication languages in which some notions of state can be modelled. In particular, some of these were proposed with the main motivation of allowing the speciication of concurrent systems: such systems incorporate small subsets of linear logic or have operational interpretations that exclude the \don't know" search behaviour expected from a logic programming language. On the other hand, systems incorporating larger subsets of linear logic must pay their expressiveness with a greater operational complexity. In this paper we present LC, a simple language combining in a uniform way the reduction and state-oriented style of speciication expected from a concurrent process calculus, with the more declarative and relational style of speciication usual in logic programming. We will also show that LC is an expressive language both as a logic programming and as a process speciication language.